Between hard and soft thresholding: optimal iterative thresholding algorithms
نویسندگان
چکیده
منابع مشابه
Accelerated iterative hard thresholding
The iterative hard thresholding algorithm (IHT) is a powerful and versatile algorithm for compressed sensing and other sparse inverse problems. The standard IHT implementation faces two challenges when applied to practical problems. The step size parameter has to be chosen appropriately and, as IHT is based on a gradient descend strategy, convergence is only linear. Whilst the choice of the ste...
متن کاملIterative Soft/Hard Thresholding Homotopy Algorithm for Sparse Recovery
In this note, we analyze an iterative soft / hard thresholding algorithm with homotopy continuation for recovering a sparse signal x† from noisy data of a noise level . Under standard regularity and sparsity conditions, we design a path along which the algorithm will find a solution x∗ which admits sharp reconstruction error ‖x−x‖`∞ = O( ) with an iteration complexity O( ln ln ρ np), where n an...
متن کاملIterative soft-thresholding converges linearly
In this article, the convergence of the often used iterative softthresholding algorithm for the solution of linear operator equations in infinite dimensional Hilbert spaces is analyzed in detail. As main result we show that the algorithm converges with linear rate as soon as the underlying operator satisfies the so-called finite basis injectivity property. This result quantifies the experience ...
متن کاملIterative Hard Thresholding with Near Optimal Projection for Signal Recovery
Recovering signals that have sparse representations under a given dictionary from a set of linear measurements got much attention in the recent decade. However, most of the work has focused on recovering the signal’s representation, forcing the dictionary to be incoherent and with no linear dependencies between small sets of its columns. A series of recent papers show that such dependencies can...
متن کاملIterative Hard Thresholding for Weighted Sparse Approximation
Recent work by Rauhut and Ward developed a notion of weighted sparsity and a corresponding notion of Restricted Isometry Property for the space of weighted sparse signals. Using these notions, we pose a best weighted sparse approximation problem, i.e. we seek structured sparse solutions to underdetermined systems of linear equations. Many computationally efficient greedy algorithms have been de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Inference: A Journal of the IMA
سال: 2019
ISSN: 2049-8764,2049-8772
DOI: 10.1093/imaiai/iaz027